An Algorithm for Generating Quanti er Scopings

نویسندگان

  • Jerry R. Hobbs
  • Stuart M. Shieber
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm For Generating Non-Redundant Quantifier Scopings

This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and ...

متن کامل

An Algorithm for Generating Quantifier Scopings

The syntactic structure of a sentence often manifests quite clearly the predicate-argument structure and relations of grammatical subordination. But scope dependencies are not so transparent. As a result, many systems for representing the semantics of sentences have ignored scoping or generated scopings with mechanisms that have often been inexplicit as to the range of scopings they choose amon...

متن کامل

Quantifier Scoping in the SRI Core Language Engine

An algorithm for generating the possible quantifier scopings for a sentence, in order of preference, is outlined. The scoping assigned to a quantifier is determined by its interactions with other quantifiers, modals, negation, and certain syntacticconstituent boundaries. When a potential scoping is logically equivalent to another, the less preferred one is discarded. The relative scoping prefer...

متن کامل

Improved Algorithms for Sign Determination and Existential Quantifier Elimination

Recently there has been a lot of activity in algorithms that work over real closed elds, and that perform such calculations as quanti er elimination or computing connected components of semi-algebraic sets. A cornerstone of this work is a symbolic sign determination algorithm due to Ben-Or, Kozen and Reif [2]. In this paper we describe a new sign determination method based on the earlier algori...

متن کامل

Incremental Syntactic and Semantic Processing

The construction of the semantic representation for a natural language sentence or a piece of discourse cannot be covered by the so-called "compositional semantics" alone. In the general case, the non-compositional construction steps of generating quantifier scop-ing and of anaphora resolution have to be included. In order to filter out unnecessary information as soon as possible it is desirabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987